Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
نویسندگان
چکیده
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computation by computing models of completion. One particular attractive candidate for the latter task is pseudo-boolean constraint solvers. To strengthen this connection, we show examples of compact encoding of aggregates and global constraints by pseudo-boolean constraints.
منابع مشابه
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Level mapping and loop formulas are two different means to justify and characterize answer sets for normal logic programs. Both of them specify conditions under which a supported model is an answer set. Though serving a similar purpose, in the past the two have been studied largely in isolation with each other. In this paper, we study level mapping and loop formulas for weight constraint and ag...
متن کاملComputing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms
The well-founded semantics of logic programs is not only an important semantics but also serves as an essential tool for program simplification in answer set computations. Recently, it has been shown that for normal and disjunctive programs, the well-founded models can be computed by unit propagation on program completion and loop formulas of loops with no external support. An attractive featur...
متن کاملLevel Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
We improve the formulations of loop formulas for weight constraint and aggregate programs by investigating the level mapping characterization of the semantics for these programs. First, we formulate a level mapping characterization of the stable model semantics for weight constraint programs, based on which we define loop formulas for these programs. This approach makes it possible to build loo...
متن کاملCharacterizations of stable model semantics for logic programs with arbitrary constraint atoms
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract representation of these constraint atoms in which a constraint atom is represented compactly. We show two applications. First, under this representation of constraint atoms, we generalize the Gelfond-Lifschitz transformation and apply it to defi...
متن کاملExtensions of Answer Set Programming
We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs where we are allowed arbitrary set constraint atoms, 3. logic programs where atoms represent sets f...
متن کامل